Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance
نویسندگان
چکیده
Recent developments in fitness landscape analysis include the study of Local Optima Networks (LON) and applications of the Elementary Landscapes theory. This paper represents a first step at combining these two tools to explore their ability to forecast the performance of search algorithms. We base our analysis on the Quadratic Assignment Problem (QAP) and conduct a large statistical study over 600 generated instances of different types. Our results reveal interesting links between the network measures, the autocorrelation measures and the performance of heuristic search algorithms.
منابع مشابه
Local Optima Networks of the Permutation Flow-Shop Problem
Abstract. This article extracts and analyzes local optima networks for the permutation flow-shop problem. Two widely used move operators for permutation representations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima netwo...
متن کاملTunnelling Crossover Networks for the Asymmetric TSP
Local optima networks are a compact representation of fitness landscapes that can be used for analysis and visualisation. This paper provides the first analysis of the Asymmetric Travelling Salesman Problem using local optima networks. These are generated by sampling the search space by recording the progress of an existing evolutionary algorithm based on the Generalised Asymmetric Partition Cr...
متن کاملFirst-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing algorithm, instead of a best-improvement (steepest-ascent) one, for the definition and extraction of the basins of attraction of the landscape optima. A statistical analysis comparing best and first improvement network models for...
متن کاملLocal Optima Networks: A New Model of Combinatorial Fitness Landscapes
This chapter overviews a recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is a graph having as vertices the local optima and as edges the possible weighted transitions between them. Two definitions of edges have been proposed: basin-transi...
متن کاملStatistical Properties of Combinatorial Landscapes: An Application to Scheduling Problems
This paper discusses the application of some statistical estimation methods in trying to understand the nature of landscapes induced by heuristic search methods. One interesting property of a landscape is the number of optima that are present. In this paper we show that it is possible to compute a confidence interval on the number of independent local searches needed to find all optima. (By ext...
متن کامل